Complexity measures from interaction structures
نویسندگان
چکیده
منابع مشابه
Complexity measures in decomposable structures
In this paper we present some measures of complexity of decomposable structures. The literature on complexity is reviewed and then the distinction among different measures of complexity is discussed. At first, a broad definition of complex systems is provided and the main characteristics of such systems are described briefly. In particular, a complex system is defined as a network of many highl...
متن کاملfür Mathematik in den Naturwissenschaften Leipzig Complexity Measures from Interaction Structures
We evaluate information theoretic quantities that quantify complexity in terms of k-th order statistical dependencies that cannot be reduced to interactions among k − 1 random variables. Using symbolic dynamics of coupled maps and cellular automata as model systems, we demonstrate that these measures are able to identify complex dynamical regimes.
متن کاملProbabilistic Methods in Landscape Analysis: phase transitions, interaction structures, and complexity measures
In recent years, the study of the phase transition behavior and typical-case complexity of search and optimization problems have become an active research topic, drawing attention from researchers from computer science, mathematics, and statistical physics. The probabilistic method that has been developed since 1960s plays an important role in this development. We give a brief introduction to t...
متن کاملOn convex complexity measures
Khrapchenko’s classical lower bound n2 on the formula size of the parity function f can be interpreted as designing a suitable measure of sub-rectangles of the combinatorial rectangle f−1(0) × f−1(1). Trying to generalize this approach we arrived at the concept of convex measures. We prove the negative result that convex measures are bounded by O(n2) and show that several measures considered fo...
متن کاملMeasures of - Complexity
We study some measures which are related to the notion of the -complexity. We prove that measure of -complexity defined on the base of the notion of -separability is equivalent to the dual measure that is defined through -nets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2009
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.79.026201